Undecidability of Weak Bisimilarity for Pushdown Processes
نویسنده
چکیده
We prove undecidability of the problem whether a given pair of pushdown processes is weakly bisimilar. We also show that this undecidability result extends to a subclass of pushdown processes satisfying the normedness condition.
منابع مشابه
Refining the Undecidability Border of Weak Bisimilarity
Weak bisimilarity is one of the most studied behavioural equivalences. This equivalence is undecidable for pushdown processes (PDA), process algebras (PA), and multiset automata (MSA, also known as parallel pushdown processes, PPDA). Its decidability is an open question for basic process algebras (BPA) and basic parallel processes (BPP). We move the undecidability border towards these classes b...
متن کاملUndecidability Results for Bisimilarity on Prefix Rewrite Systems
We answer an open question related to bisimilarity checking on labelled transition systems generated by prefix rewrite rules on words. Stirling (1996, 1998) proved the decidability of bisimilarity for normed pushdown processes. This result was substantially extended by Sénizergues (1998, 2005) who showed the decidability for regular (or equational) graphs of finite out-degree (which include unn...
متن کاملCompleteness Results for Undecidable Bisimilarity Problems
We establish Σ11-completeness (in the analytical hierarchy) of weak bisimilarity checking for infinite-state processes generated by pushdown automata and parallel pushdown automata. The results imply Σ11-completeness of weak bisimilarity for Petri nets and give a negative answer to the open problem stated by Jančar (CAAP’95): “does the problem of weak bisimilarity for Petri nets belong to ∆11?”
متن کاملNote on Undecidability of Bisimilarity for Second-Order Pushdown Processes
Broadbent and Göller (FSTTCS 2012) proved the undecidability of bisimulation equivalence for processes generated by ε-free second-order pushdown automata. We add a few remarks concerning the used proof technique, called Defender’s forcing, and the related undecidability proof for first-order pushdown automata with ε-transitions (Jančar and Srba, JACM 2008). Language equivalence of pushdown auto...
متن کاملOn the Complexity of Bisimulation Problems for Pushdown Automata
All bisimulation problems for pushdown automata are at least PSPACE-hard. In particular, we show that (1) Weak bisimilarity of pushdown automata and nite automata is PSPACE-hard, even for a small xed nite automaton, (2) Strong bisimilarity of pushdown au-tomata and nite automata is PSPACE-hard, but polynomial for every xed nite automaton, (3) Regularity ((niteness) of pushdown automata w.r.t. w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002